Heuristic approach to the passive optical network with fibre duct sharing planning problem
نویسندگان
چکیده
منابع مشابه
The Stochastic Knapsack Problem with Random Weights: A Heuristic Approach to Robust Transportation Planning
When transportation plans are developed, problem parameters are often not known with certainty. In addition, the parameters may vary throughout the time period during which the plan is implemented. Thus, improvements can often be made in the quality of such plans by accounting for this variability. However, incorporating stochasticity into problems that are already large-scale and difficult to ...
متن کاملUsing Metaheuristic Algorithms for Solving a Hub Location Problem: Application in Passive Optical Network Planning
Nowadays, fiber-optic are counted as one of the most important tools for data transfer due to having greater bandwidth and being more efficient compared with other similar technologies,. In this article, an integrated mathematical model for a three-level fiber-optic distribution network is presented with consideration of simultaneous backbone and local access networks the backbone network is a ...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملCombined Heuristic and Evolutionary approach for Reactive Power Planning Problem
In this paper authors have used mixed heuristic and evolutionary technique for solving the reactive power problem. In doing so, power system control variables are treated as planning & dispatch variables. All the variables of the reactive power optimization problem do not involve cost. The variables which does not involve cost treated as dispatch variable and those involve cost are treated as p...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORiON
سال: 2015
ISSN: 2224-0004
DOI: 10.5784/31-2-532